n,a,b=list(map(int,input().split()))
c=b%n
if c>=0:
f=a+c
if f>n:
print(f-n)
else:
print(f)
else:
d=n+b
f=a+d
if f>n:
print(f-n)
else:
print(f)#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a ,b;
cin>>n>>a>>b;
int k;
if(b<0){
while(b<0){
b+=n;
}
}
k = (a+b) % n;
if(k==0) k = n;
cout<<k<<endl;
return 0;
}380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |